A Moore bound for simplicial complexes
نویسندگان
چکیده
منابع مشابه
A Moore Bound for Simplicial Complexes
Let X be a d-dimensional simplicial complex with N faces of dimension d− 1. Suppose that every (d−1)-face of X is contained in at least k ≥ d+2 faces of X of dimension d. Extending the classical Moore bound for graphs, it is shown that X must contain a ball B of radius at most dlogk−d Ne whose d-dimensional homology Hd(B) is non-zero. The Ramanujan Complexes constructed by Lubotzky, Samuels and...
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملLower Bound Theorems and a Generalized Lower Bound Conjecture for balanced simplicial complexes
A (d − 1)-dimensional simplicial complex is called balanced if its underlying graph admits a proper d-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs). Specifically, we prove the balanced analog of the celebrated Lower Bound Theorem for normal pseudomanifolds and characterize the case of equality; we introduce and ch...
متن کاملA revised Moore bound for mixed graphs
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity is focussed on finding new examples of graphs or families of graph with orders approaching the bound as closely as possible. There has been recent interest ...
متن کاملA GAP toolbox for simplicial complexes
simpcomp is a GAP package for working with simplicial complexes. It allows the computation of many properties of simplicial complexes (such as the f -, gand h-vectors, the face lattice, the automorphism group, (co-)homology with explicit basis computation, intersection form, etc.) and provides the user with functions to compute new complexes from old (simplex links and stars, connected sums, ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the London Mathematical Society
سال: 2007
ISSN: 0024-6093
DOI: 10.1112/blms/bdm003